optimality condition

См. также в других словарях:

• Legendre-Clebsch condition — In optimal control, the Legendre Clebsch condition, also known as convexitycite book author = Choset, H.M. year = 2005 title = Principles of Robot Motion: Theory, Algorithms, and Implementation publisher = The MIT Press isbn = 0262033275] , is a… …   Wikipedia

• Arnoldi iteration — In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of iterative methods. Arnoldi finds the eigenvalues of general (possibly non Hermitian) matrices; an analogous method for Hermitian matrices is …   Wikipedia

• Theory of the Second Best — The Theory of the Second Best concerns what happens when one or more optimality conditions are not satisfied in an economic model. Canadian economist Richard Lipsey and Australian American economist Kelvin Lancaster showed in a 1956 paper that if …   Wikipedia

• nature, philosophy of — Introduction       the discipline that investigates substantive issues regarding the actual features of nature as a reality. The discussion here is divided into two parts: the philosophy of physics and the philosophy of biology.       In this… …   Universalium

• Karush–Kuhn–Tucker conditions — In mathematics, the Karush–Kuhn–Tucker (KKT) conditions (also known as the Kuhn–Tucker conditions) are necessary for a solution in nonlinear programming to be optimal, provided that some regularity conditions are satisfied. Allowing inequality… …   Wikipedia

• Optimal control — theory, an extension of the calculus of variations, is a mathematical optimization method for deriving control policies. The method is largely due to the work of Lev Pontryagin and his collaborators in the Soviet Union[1] and Richard Bellman in… …   Wikipedia

• Conditions d'optimalité (dimension finie) — En optimisation mathématique, les conditions d optimalité sont un ensemble d équations, d inéquations (i.e., des inégalités) et d expressions diverses (e.g., la semi définie positivité de matrices sur des cônes) vérifiées par une solution d un… …   Wikipédia en Français

• Qualification de contraintes — En mathématiques, lorsqu une partie d un espace normé est décrit par des fonctions différentiables, appelées contraintes dans ce contexte, la question se pose de savoir si l on peut obtenir le cône tangent à cet ensemble en linéarisant ces… …   Wikipédia en Français

• Bellman equation — A Bellman equation (also known as a dynamic programming equation), named after its discoverer, Richard Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes… …   Wikipedia

• Multidisciplinary design optimization — Multi disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of disciplines. As defined by Prof. Carlo Poloni, MDO is the art of finding the best compromise …   Wikipedia

• Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… …   Wikipedia